Conservative logic

نویسنده

  • Tommaso Toffoli
چکیده

Conservative logic is a comprehensive model of computation which explicitly reflects a number of fundamental principles of physics, such as the reversibility of the dynamical laws and the conservation of certain additive quantities (among which energy plays a distinguished role). Because it more closely mirrors physics than traditional models of computation, conservative logic is in a better position to provide indications concerning the realization of high-performance computing systems, i.e., of systems that make very efficient use of the "computing resources" actually offered by nature. In particular, conservative logic shows that it is ideally possible to build sequential circuits with zero internal power dissipation. After establishing a general framework, we discuss two specific models of computation. The first uses binary variables and is the conservative-logic counterpart of switching theory; this model proves that universal computing capabilities are compatible with the reversibility and conservation constraints. The second model, which is a refinement of the first, constitutes a substantial breakthrough in establishing a correspondence between computation and physics. In fact, this model is based on elastic collisions of identical "balls," and thus is formally identical with the atomic model that underlies the (classical) kinetic theory of perfect gases. Quite literally, the functional behavior of a general-purpose digital computer can be reproduced by a perfect gas placed in a suitably shaped container and given appropriate initial conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conservative Extensions in Guarded and Two-Variable Fragments

Conservative extensions are a fundamental notion in logic. In the area of description logic, deciding whether a logical theory is a conservative extension of another theory is a fundamental reasoning task with applications in ontology modularity and reuse, and ontology versioning. As expected, conservative extensions are undecidable in first-order logic (FO), but it has been observed in recent ...

متن کامل

The Conservative Extension of MV-Algebras to Pavelka Algebras

In this paper we prove algebraic equivalents of the conservative extension theorems of Lukasiewicz propositional logic to rational Pavelka propositional logic. The results concerns the conservative extension and the very conservative extension of MV-algebras to Pavelka algebras.

متن کامل

Conservative Rewritability of Description Logic TBoxes

We investigate the problem of conservative rewritability of a TBox T in a description logic (DL) L into a TBox T ′ in a weaker DL L′. We focus on model-conservative rewritability (T ′ entails T and all models of T are expandable to models of T ′), subsumption-conservative rewritability (T ′ entails T and all subsumptions in the signature of T entailed by T ′ are entailed by T ), and standard DL...

متن کامل

Conservative Extensions in the Lightweight Description Logic EL

We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for formalizing notions of ontology design such as refinement and modularity. Our aim is to investigate conservative extensions as an automated reasoning problem for the basic tractable DL EL. The main result is that deciding ...

متن کامل

First-Order Modular Logic Programs and their Conservative Extensions (Extended Abstract)

This paper introduces first-order modular logic programs, which provide a way of viewing answer set programs as consisting of many independent, meaningful modules. We also present conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. For example, we illustrate how the notion of a conservati...

متن کامل

Conservative Expansion Concepts for Default Theories

Conservative extensions of logical theories play an important role in software engineering. They provide a formal basis for program reenement and guarantee the integrity and transparency of modules and objects. This paper studies conservative extension ideas in the context of default logic. In particular, we deene several alternative concepts, study their properties, and derive interconnections...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001